A cut-free sequent system for two-dimensional modal logic, and why it matters

نویسنده

  • Greg Restall
چکیده

The two-dimensional modal logic of Davies and Humberstone [3] is an important aid to our understanding the relationship between actuality, necessity and a priori knowability. I show how a cut-free hypersequent calculus for 2d modal logic not only captures the logic precisely, but may be used to address issues in the epistemology and metaphysics of our modal concepts. I will explain how use of our concepts motivates the inference rules of the sequent calculus, and then show that the completeness of the calculus for Davies–Humberstone models explains why those concepts have the structure described by those models. The result is yet another application of the completeness theorem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Axiomatizing Epistemic Logic of Friendship via Tree Sequent Calculus

This paper positively solves an open problem if it is possible to provide a Hilbert system to Epistemic Logic of Friendship (EFL) by Seligman, Girard and Liu. To find a Hilbert system, we first introduce a sound, complete and cut-free tree (or nested) sequent calculus for EFL, which is an integrated combination of Seligman’s sequent calculus for basic hybrid logic and a tree sequent calculus fo...

متن کامل

0 N ov 2 01 7 A Cut - free sequent calculus for modal logic S 5 ∗ †

Providing a cut-free sequent calculus for S5 has a long history. The efforts in this direction are numerous, and each of them presents some difficulties. In this paper, we present a sequent calculus system for modal logic S5. It has in a sense subformula property. We show that the cut rule is admissible in this system.

متن کامل

A sequent system for the interpretability logic with the persistence axiom

In [Sas01], it was given a cut-free sequent system for the smallest interpretability logic IL. He first gave a cut-free system for IK4, a sublogic of IL, whose ✄-free fragment is the modal logic K4. Here, using the method in [Sas01], we give sequent systems for the interpretability logic ILP obtained by adding the persistence axiom P : (p✄ q) ⊃ ✷(p✄ q) to IL and for the logic IK4+P obtained by ...

متن کامل

A Contraction-free and Cut-free Sequent Calculus for Propositional Dynamic Logic

In this paper we present a sequent calculus for propositional dynamic logic built using an enriched version of the tree-hypersequent method and including an infinitary rule for the iteration operator. We prove that this sequent calculus is theoremwise equivalent to the corresponding Hilbert-style system, and that it is contraction-free and cut-free. All results are proved in a purely syntactic ...

متن کامل

Proof systems for the coalgebraic cover modality

We investigate an alternative presentation of classical and positive modal logic where the coalgebraic cover modality is taken as primitive. For each logic, we present a sound and complete Hilbert-style axiomatization. Moreover, we give a two-sided sound and complete sequent calculus for the negation-free language, and for the language with negation we provide a one-sided sequent calculus which...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Ann. Pure Appl. Logic

دوره 163  شماره 

صفحات  -

تاریخ انتشار 2012